翻訳と辞書
Words near each other
・ Semantic analysis (knowledge representation)
・ Semantic analysis (linguistics)
・ Semantic analysis (machine learning)
・ Semantic analytics
・ Semantic Application Design Language
・ Semantic architecture
・ Semantic audio
・ Semantic broker
・ Semantic change
・ Semantic class
・ Semantic compaction
・ Semantic compression
・ Semantic computing
・ Semantic Copyright
・ Semantic data model
Semantic decision table
・ Semantic dementia
・ Semantic desktop
・ Semantic dictionary encoding
・ Semantic differential
・ Semantic discord
・ Semantic dispute
・ Semantic domain
・ Semantic dyslexia
・ Semantic equivalence
・ Semantic externalism
・ Semantic feature
・ Semantic feature-comparison model
・ Semantic field
・ Semantic file system


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Semantic decision table : ウィキペディア英語版
Semantic decision table
Semantic decision tables (SDT) use modern ontology engineering (OE) technologies to enhance traditional decision tables. The term "semantic decision table" was coined by Yan Tang and Prof. Robert Meersman from VUB STARLab (Free University of Brussels) in 2006. An SDT is a (set of) decision table(s) properly annotated with an ontology. It provides a means to capture and examine decision makers’ concepts, as well as a tool for refining their decision knowledge and facilitating knowledge sharing in a scalable manner.
==Background==
SDT is a decision table. A decision table is defined as a "tabular method of showing the relationship between a series of conditions and the resultant actions to be executed". Following the de facto international standard (CSA, 1970), a decision table contains three building blocks: the conditions, the actions (or decisions), and the rules.
A ''decision condition'' is constructed with a ''condition stub'' and a ''condition entry''. A ''condition stub'' is declared as a statement of a condition. A ''condition entry'' provides a value assigned to the condition stub. Similarly, an ''action'' (or ''decision'') composes two elements: an ''action stub'' and an ''action entry''. One states an action with an action stub. An action entry specifies whether (or in what order) the action is to be performed.
A decision table separates the data (that is the condition entries and decision/action entries) from the decision templates (that are the condition stubs, decision/action stubs, and the relations between them). Or rather, a decision table can be a tabular result of its meta-rules.
Traditional decision tables have many advantages compared to other decision support manners, such as if-then-else programming statements, decision trees and Bayesian networks. A traditional decision table is compact and easily understandable. However, it still has several limitations. For instance, a decision table often faces the problems of ''conceptual ambiguity'' and ''conceptual duplication''; and it is ''time consuming'' to create and maintain ''large'' decision tables. Semantic decision tables are an attempt to solve these problems.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Semantic decision table」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.